Balanced Allocations

Ex post renegotiation-proof mechanism design

We study what kind of equilibria of which mechanisms are ex post renegotiation-proof (EPRP), i.e., robust against the possibility of ex post renegotiation under a variety of renegotiation procedures, and which social choice functions are EPRP implementable. In complete information environments with two agents only budget balanced Groves allocations are EPRP implementable, while with three or mo...

Possible and Necessary Allocations via Sequential Mechanisms

A simple mechanism for allocating indivisible resources is sequential allocation in which agents take turns to pick items. We focus on possible and necessary allocation problems, checking whether allocations of a given form occur in some or all mechanisms for several commonly used classes of sequential allocation mechanisms. In particular, we consider whether a given agent receives a given item...

Implementation of balanced linear cost share equilibrium solution in Nash and strong Nash equilibria

This paper considers the incentive aspect of the Balanced Linear Cost Share Equilibrium (BLCSE), which yields an endogenous theory of profit distribution for public goods economies with convex production technologies. We do so by presenting an incentive compatible mechanism which doubly implements the BLCSE solution in Nash and strong Nash equilibria so that Nash allocations and strong Nash all...

Towards Balanced Allocations for DHTs

Budget balance, fairness, and minimal manipulability

A common real-life problem is to fairly allocate a number of indivisible objects and a fixed amount of money among a group of agents. Fairness requires that each agent weakly prefers his consumption bundle to any other agent’s bundle. In this context, fairness is incompatible with budget balance and nonmanipulability (Green and Laffont 1979). Our approach here is to weaken or abandon nonmanipul...

Computational aspects of balanced fairness

Flow level behaviour of data networks depends on the allocation of link capacities between competing flows. It has been recently shown that there exist allocations with the property that the stationary distribution of the number of flows in progress on different routes depends only on the traffic loads on these routes and is insensitive to any detailed traffic characteristics. Balanced fairness...